0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.14	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.14/0.35	% Computer   : n012.cluster.edu
0.14/0.35	% Model      : x86_64 x86_64
0.14/0.35	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory     : 8042.1875MB
0.14/0.35	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 1200
0.14/0.35	% WCLimit    : 120
0.14/0.35	% DateTime   : Tue Jul 13 13:44:01 EDT 2021
0.14/0.35	% CPUTime    : 
0.14/0.35	% Number of cores: 8
0.14/0.36	% Python version: Python 3.6.8
0.14/0.36	# Version: 2.6rc1-ho
0.14/0.37	# No SInE strategy applied
0.14/0.37	# Trying AutoSched0 for 59 seconds
0.22/0.41	# AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
0.22/0.41	# and selection function SelectComplexExceptUniqMaxHorn.
0.22/0.41	#
0.22/0.41	# Preprocessing time       : 0.035 s
0.22/0.41	# Presaturation interreduction done
0.22/0.41	
0.22/0.41	# Proof found!
0.22/0.41	# SZS status Theorem
0.22/0.41	# SZS output start CNFRefutation
0.22/0.41	thf(pushprop_lem0, axiom, (pushprop_lem0<=>![X6:term > $o, X1:term, X3:subst]:?[X9:term > $o]:pushprop_p_and_p_prime @ X1 @ X3 @ X6 @ X9), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', pushprop_lem0)).
0.22/0.41	thf(pushprop_p_and_p_prime, axiom, (pushprop_p_and_p_prime)=(^[X1:term, X3:subst, X6:term > $o, X9:term > $o]:![X10:term]:(X9 @ X10<=>X6 @ (sub @ X10 @ (push @ X1 @ X3)))), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', pushprop_p_and_p_prime)).
0.22/0.41	thf(pushprop_lthm, axiom, (pushprop_lthm<=>(pushprop_lem0=>(ulamvar1=>(axvarcons=>(axclos=>(axshiftcons=>(ulamvarind=>pushprop))))))), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', pushprop_lthm)).
0.22/0.41	thf(axvarcons, axiom, (axvarcons<=>![X1:term, X3:subst]:(sub @ one @ (push @ X1 @ X3))=(X1)), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', axvarcons)).
0.22/0.41	thf(axclos, axiom, (axclos<=>![X1:term, X3:subst, X4:subst]:(sub @ (sub @ X1 @ X3) @ X4)=(sub @ X1 @ (comp @ X3 @ X4))), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', axclos)).
0.22/0.41	thf(axshiftcons, axiom, (axshiftcons<=>![X1:term, X3:subst]:(comp @ sh @ (push @ X1 @ X3))=(X3)), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', axshiftcons)).
0.22/0.41	thf(ulamvar1, axiom, (ulamvar1<=>var @ one), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', ulamvar1)).
0.22/0.41	thf(ulamvarind, axiom, (ulamvarind<=>![X6:term > $o]:(X6 @ one=>(![X1:term]:(var @ X1=>(X6 @ X1=>X6 @ (sub @ X1 @ sh)))=>![X1:term]:(var @ X1=>X6 @ X1)))), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', ulamvarind)).
0.22/0.41	thf(pushprop, axiom, (pushprop<=>![X6:term > $o, X1:term, X3:subst]:(![X2:term]:(var @ X2=>X6 @ (sub @ X2 @ X3))=>(X6 @ X1=>![X2:term]:(var @ X2=>X6 @ (sub @ X2 @ (push @ X1 @ X3)))))), file('/export/starexec/sandbox2/benchmark/Axioms/ALG003^0.ax', pushprop)).
0.22/0.41	thf(thm, conjecture, pushprop_lthm, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', thm)).
0.22/0.41	thf(c_0_10, axiom, (pushprop_lem0)=(![X6:term > $o, X1:term, X3:subst]:?[X9:term > $o]:![X326:term]:(X9 @ X326<=>X6 @ (sub @ X326 @ (push @ X1 @ X3)))), inference(apply_def,[status(thm)],[pushprop_lem0, pushprop_p_and_p_prime])).
0.22/0.41	thf(c_0_11, axiom, (pushprop_lthm)=((![X6:term > $o, X1:term, X3:subst]:?[X9:term > $o]:![X324:term]:(X9 @ X324<=>X6 @ (sub @ X324 @ (push @ X1 @ X3)))=>(var @ one=>(![X1:term, X3:subst]:(sub @ one @ (push @ X1 @ X3))=(X1)=>(![X1:term, X3:subst, X4:subst]:(sub @ (sub @ X1 @ X3) @ X4)=(sub @ X1 @ (comp @ X3 @ X4))=>(![X1:term, X3:subst]:(comp @ sh @ (push @ X1 @ X3))=(X3)=>(![X6:term > $o]:(X6 @ one=>(![X1:term]:(var @ X1=>(X6 @ X1=>X6 @ (sub @ X1 @ sh)))=>![X1:term]:(var @ X1=>X6 @ X1)))=>![X6:term > $o, X1:term, X3:subst]:(![X2:term]:(var @ X2=>X6 @ (sub @ X2 @ X3))=>(X6 @ X1=>![X2:term]:(var @ X2=>X6 @ (sub @ X2 @ (push @ X1 @ X3)))))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[pushprop_lthm, axvarcons]), axclos]), axshiftcons]), ulamvar1]), ulamvarind]), pushprop_p_and_p_prime]), c_0_10]), pushprop])).
0.22/0.41	thf(c_0_12, negated_conjecture, ~((![X6:term > $o, X1:term, X3:subst]:?[X9:term > $o]:![X324:term]:(X9 @ X324<=>X6 @ (sub @ X324 @ (push @ X1 @ X3)))=>(var @ one=>(![X1:term, X3:subst]:(sub @ one @ (push @ X1 @ X3))=(X1)=>(![X1:term, X3:subst, X4:subst]:(sub @ (sub @ X1 @ X3) @ X4)=(sub @ X1 @ (comp @ X3 @ X4))=>(![X1:term, X3:subst]:(comp @ sh @ (push @ X1 @ X3))=(X3)=>(![X6:term > $o]:(X6 @ one=>(![X1:term]:(var @ X1=>(X6 @ X1=>X6 @ (sub @ X1 @ sh)))=>![X1:term]:(var @ X1=>X6 @ X1)))=>![X6:term > $o, X1:term, X3:subst]:(![X2:term]:(var @ X2=>X6 @ (sub @ X2 @ X3))=>(X6 @ X1=>![X2:term]:(var @ X2=>X6 @ (sub @ X2 @ (push @ X1 @ X3)))))))))))), inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]), c_0_11])).
0.22/0.41	thf(c_0_13, negated_conjecture, ![X335:term > $o, X336:term, X337:subst, X339:term, X340:term, X341:term, X342:subst, X343:term, X344:subst, X345:subst, X346:term, X347:subst, X348:term > $o, X350:term, X354:term]:(((~epred1_3 @ X335 @ X336 @ X337 @ X339|X335 @ (sub @ X339 @ (push @ X336 @ X337)))&(~X335 @ (sub @ X340 @ (push @ X336 @ X337))|epred1_3 @ X335 @ X336 @ X337 @ X340))&(var @ one&((sub @ one @ (push @ X341 @ X342))=(X341)&((sub @ (sub @ X343 @ X344) @ X345)=(sub @ X343 @ (comp @ X344 @ X345))&((comp @ sh @ (push @ X346 @ X347))=(X347)&(((var @ (esk1_1 @ X348)|(~var @ X350|X348 @ X350)|~X348 @ one)&((X348 @ (esk1_1 @ X348)|(~var @ X350|X348 @ X350)|~X348 @ one)&(~X348 @ (sub @ (esk1_1 @ X348) @ sh)|(~var @ X350|X348 @ X350)|~X348 @ one)))&((~var @ X354|epred2_0 @ (sub @ X354 @ esk3_0))&(epred2_0 @ esk2_0&(var @ esk4_0&~epred2_0 @ (sub @ esk4_0 @ (push @ esk2_0 @ esk3_0))))))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])])])).
0.22/0.41	thf(c_0_14, negated_conjecture, ![X1:term, X3:subst, X4:subst]:(sub @ (sub @ X1 @ X3) @ X4)=(sub @ X1 @ (comp @ X3 @ X4)), inference(split_conjunct,[status(thm)],[c_0_13])).
0.22/0.41	thf(c_0_15, negated_conjecture, ![X1:term, X3:subst]:(comp @ sh @ (push @ X1 @ X3))=(X3), inference(split_conjunct,[status(thm)],[c_0_13])).
0.22/0.41	thf(c_0_16, negated_conjecture, ![X6:term > $o, X1:term, X2:term, X3:subst]:(epred1_3 @ X6 @ X2 @ X3 @ X1|~X6 @ (sub @ X1 @ (push @ X2 @ X3))), inference(split_conjunct,[status(thm)],[c_0_13])).
0.22/0.41	thf(c_0_17, negated_conjecture, ![X1:term, X2:term, X3:subst]:(sub @ (sub @ X1 @ sh) @ (push @ X2 @ X3))=(sub @ X1 @ X3), inference(spm,[status(thm)],[c_0_14, c_0_15])).
0.22/0.41	thf(c_0_18, negated_conjecture, ![X1:term, X6:term > $o]:(X6 @ X1|~X6 @ (sub @ (esk1_1 @ X6) @ sh)|~var @ X1|~X6 @ one), inference(split_conjunct,[status(thm)],[c_0_13])).
0.22/0.41	thf(c_0_19, negated_conjecture, ![X6:term > $o, X1:term, X2:term, X3:subst]:(epred1_3 @ X6 @ X1 @ X3 @ (sub @ X2 @ sh)|~X6 @ (sub @ X2 @ X3)), inference(spm,[status(thm)],[c_0_16, c_0_17])).
0.22/0.41	thf(c_0_20, negated_conjecture, ![X6:term > $o, X1:term, X3:subst, X2:term]:(epred1_3 @ X6 @ X1 @ X3 @ X2|~X6 @ (sub @ (esk1_1 @ (epred1_3 @ X6 @ X1 @ X3)) @ X3)|~epred1_3 @ X6 @ X1 @ X3 @ one|~var @ X2), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.22/0.41	thf(c_0_21, negated_conjecture, ![X1:term]:(epred2_0 @ (sub @ X1 @ esk3_0)|~var @ X1), inference(split_conjunct,[status(thm)],[c_0_13])).
0.22/0.41	thf(c_0_22, negated_conjecture, ![X1:term, X6:term > $o]:(var @ (esk1_1 @ X6)|X6 @ X1|~var @ X1|~X6 @ one), inference(split_conjunct,[status(thm)],[c_0_13])).
0.22/0.41	thf(c_0_23, negated_conjecture, ![X3:subst, X1:term]:(sub @ one @ (push @ X1 @ X3))=(X1), inference(split_conjunct,[status(thm)],[c_0_13])).
0.22/0.41	thf(c_0_24, negated_conjecture, ![X1:term, X2:term]:(epred1_3 @ epred2_0 @ X1 @ esk3_0 @ X2|~epred1_3 @ epred2_0 @ X1 @ esk3_0 @ one|~var @ X2), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])).
0.22/0.41	thf(c_0_25, negated_conjecture, ![X6:term > $o, X3:subst, X1:term]:(epred1_3 @ X6 @ X1 @ X3 @ one|~X6 @ X1), inference(spm,[status(thm)],[c_0_16, c_0_23])).
0.22/0.41	thf(c_0_26, negated_conjecture, ![X6:term > $o, X1:term, X3:subst, X2:term]:(X6 @ (sub @ X2 @ (push @ X1 @ X3))|~epred1_3 @ X6 @ X1 @ X3 @ X2), inference(split_conjunct,[status(thm)],[c_0_13])).
0.22/0.41	thf(c_0_27, negated_conjecture, ![X2:term, X1:term]:(epred1_3 @ epred2_0 @ X1 @ esk3_0 @ X2|~var @ X2|~epred2_0 @ X1), inference(spm,[status(thm)],[c_0_24, c_0_25])).
0.22/0.41	thf(c_0_28, negated_conjecture, ~epred2_0 @ (sub @ esk4_0 @ (push @ esk2_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_13])).
0.22/0.41	thf(c_0_29, negated_conjecture, ![X1:term, X2:term]:(epred2_0 @ (sub @ X1 @ (push @ X2 @ esk3_0))|~var @ X1|~epred2_0 @ X2), inference(spm,[status(thm)],[c_0_26, c_0_27])).
0.22/0.41	thf(c_0_30, negated_conjecture, var @ esk4_0, inference(split_conjunct,[status(thm)],[c_0_13])).
0.22/0.41	thf(c_0_31, negated_conjecture, epred2_0 @ esk2_0, inference(split_conjunct,[status(thm)],[c_0_13])).
0.22/0.41	thf(c_0_32, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30]), c_0_31])]), ['proof']).
0.22/0.41	# SZS output end CNFRefutation
0.22/0.41	# Proof object total steps             : 33
0.22/0.41	# Proof object clause steps            : 19
0.22/0.41	# Proof object formula steps           : 14
0.22/0.41	# Proof object conjectures             : 22
0.22/0.41	# Proof object clause conjectures      : 19
0.22/0.41	# Proof object formula conjectures     : 3
0.22/0.41	# Proof object initial clauses used    : 11
0.22/0.41	# Proof object initial formulas used   : 10
0.22/0.41	# Proof object generating inferences   : 8
0.22/0.41	# Proof object simplifying inferences  : 4
0.22/0.41	# Training examples: 0 positive, 0 negative
0.22/0.41	# Parsed axioms                        : 238
0.22/0.41	# Removed by relevancy pruning/SinE    : 0
0.22/0.41	# Initial clauses                      : 139
0.22/0.41	# Removed in clause preprocessing      : 124
0.22/0.41	# Initial clauses in saturation        : 15
0.22/0.41	# Processed clauses                    : 107
0.22/0.41	# ...of these trivial                  : 1
0.22/0.41	# ...subsumed                          : 41
0.22/0.41	# ...remaining for further processing  : 65
0.22/0.41	# Other redundant clauses eliminated   : 3
0.22/0.41	# Clauses deleted for lack of memory   : 0
0.22/0.41	# Backward-subsumed                    : 0
0.22/0.41	# Backward-rewritten                   : 0
0.22/0.41	# Generated clauses                    : 210
0.22/0.41	# ...of the previous two non-trivial   : 152
0.22/0.41	# Contextual simplify-reflections      : 1
0.22/0.41	# Paramodulations                      : 154
0.22/0.41	# Factorizations                       : 0
0.22/0.41	# NegExts                              : 0
0.22/0.41	# Equation resolutions                 : 3
0.22/0.41	# Propositional unsat checks           : 0
0.22/0.41	#    Propositional check models        : 0
0.22/0.41	#    Propositional check unsatisfiable : 0
0.22/0.41	#    Propositional clauses             : 0
0.22/0.41	#    Propositional clauses after purity: 0
0.22/0.41	#    Propositional unsat core size     : 0
0.22/0.41	#    Propositional preprocessing time  : 0.000
0.22/0.41	#    Propositional encoding time       : 0.000
0.22/0.41	#    Propositional solver time         : 0.000
0.22/0.41	#    Success case prop preproc time    : 0.000
0.22/0.41	#    Success case prop encoding time   : 0.000
0.22/0.41	#    Success case prop solver time     : 0.000
0.22/0.41	# Current number of processed clauses  : 50
0.22/0.41	#    Positive orientable unit clauses  : 11
0.22/0.41	#    Positive unorientable unit clauses: 10
0.22/0.41	#    Negative unit clauses             : 1
0.22/0.41	#    Non-unit-clauses                  : 28
0.22/0.41	# Current number of unprocessed clauses: 71
0.22/0.41	# ...number of literals in the above   : 190
0.22/0.41	# Current number of archived formulas  : 0
0.22/0.41	# Current number of archived clauses   : 15
0.22/0.41	# Clause-clause subsumption calls (NU) : 176
0.22/0.41	# Rec. Clause-clause subsumption calls : 144
0.22/0.41	# Non-unit clause-clause subsumptions  : 9
0.22/0.41	# Unit Clause-clause subsumption calls : 10
0.22/0.41	# Rewrite failures with RHS unbound    : 126
0.22/0.41	# BW rewrite match attempts            : 50
0.22/0.41	# BW rewrite match successes           : 8
0.22/0.41	# Condensation attempts                : 0
0.22/0.41	# Condensation successes               : 0
0.22/0.41	# Termbank termtop insertions          : 18628
0.22/0.41	
0.22/0.41	# -------------------------------------------------
0.22/0.41	# User time                : 0.043 s
0.22/0.41	# System time              : 0.009 s
0.22/0.41	# Total time               : 0.052 s
0.22/0.41	# Maximum resident set size: 2000 pages
0.22/0.41	EOF